package Leetcode;

/**
 * @ Author     ：侯耀祖
 * @ Description：
 */
public class maxSubArray {
    public int maxSubArray(int[] nums) {
        int[] dp = new int[nums.length];
        dp[0] = nums[0];
        int res = nums[0];
        for (int i = 1; i < nums.length; i++) {
            dp[i] = Math.max(dp[i - 1] + nums[0], nums[i]);
            res = Math.max(dp[i], res);
        }
        return res;
    }
}
